State-Adaptive Coded Caching for Symmetric Broadcast Channels
نویسندگان
چکیده
Coded-caching delivery is considered over a symmetric noisy broadcast channel whose state is unknown at the transmitter during the cache placement phase. In particular, the delivery phase is modeled by a state-dependent broadcast channel where the state remains constant over each transmission block and is learned by the transmitter (and the receivers) only at the beginning of each block. A state-adaptive coded caching scheme is proposed that improves either on rate or decoding latency over two baseline schemes that are based on standard coded caching.
منابع مشابه
Adaptive Coded Caching for Fair Delivery over Fading Channels
The performance of existing coded caching schemes is sensitive to the worst channel quality, a problem which is exacerbated when communicating over fading channels. In this paper, we address this limitation in the following manner: in short-term, we allow transmissions to subsets of users with good channel quality, avoiding users with fades, while in long-term we ensure fairness among users. Ou...
متن کاملA Note on Broadcast Channels with Stale State Information at the Transmitter
This paper shows that the Maddah-Ali–Tse scheme which establishes the symmetric capacity of two example broadcast channels with strictly causal state information at the transmitter is a simple special case of the Shayevitz– Wigger scheme for the broadcast channel with generalized feedback, which involves block Markov coding, compression, superposition coding, Marton coding, and coded time shari...
متن کاملCaching and Coded Delivery over Gaussian Broadcast Channels for Energy Efficiency
A cache-aided K-user Gaussian broadcast channel (BC) is considered. The transmitter has a library ofN equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required transmit power to satisfy all user demands is studied. Considering uniformly random demands across the library, both the minimum average power (averaged over all ...
متن کاملOn Multi-Server Coded Caching in the Low Memory Regime
In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small.We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at the content delivery phase. Surprisingly, in contrast to previous multi-server results which were proved to be order-optimal within a multiplicative factor of ...
متن کاملUtility Optimal Scheduling for Coded Caching in General Topologies
We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand performs poorly especially in the regime of a large number of users due to a vanishing multicast rate. We overcome this detrimental effect by a careful design o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.00319 شماره
صفحات -
تاریخ انتشار 2017